package cn.kuick.match3.test2;


public class JumpStep {

	public static int handle(int n) {
		 int[] f = new int[n + 1];
		 
		 f[0] = 0;
		 f[1] = 1;
		 f[2] = 2;
		 
		 for(int i=3; i<n + 1; i++) {
			 f[i] = f[i - 2] + f[i - 1];
		 }
		 
		 return f[n];
	}
	
	public static void main(String[] args) {
		System.out.println(handle(7));
		System.out.println(handle(20));
	}

}
